| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZeBBx/w9y2f |
| Repository | sid.inpe.br/banon/2002/11.13.11.53 |
| Last Update | 2002:11.13.02.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2002/11.13.11.54 |
| Metadata Last Update | 2022:06.18.19.36.01 (UTC) administrator |
| DOI | 10.1109/SIBGRA.2000.883922 |
| Citation Key | LotufoFalcZamp:2000:FaEuDi |
| Title | Fast Euclidean distance transform using a graph-search algorithm  |
| Year | 2000 |
| Access Date | 2024, May 04 |
| Number of Files | 1 |
| Size | 400 KiB |
| 2. Context | |
| Author | 1 Lotufo, Roberto A. 2 Falcão, Alexandre Xavier 3 Zampirolli, Francisco A. |
| Editor | Carvalho, Paulo Cezar Pinto Walter, Marcelo |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI) |
| Conference Location | Gramado, RS, Brazil |
| Date | 17-20 Oct. 2000 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Pages | 269-275 |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| Organization | SBC - Brazilian Computer Society |
| History (UTC) | 2008-07-17 14:10:51 :: administrator -> banon :: 2008-08-26 15:23:02 :: banon -> administrator :: 2009-08-13 20:37:03 :: administrator -> banon :: 2010-08-28 20:00:11 :: banon -> administrator :: 2022-06-18 19:36:01 :: administrator -> :: 2000 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | tree searching Fast Euclidean distance transform shortest path forest problem shortest path graph-search sequential algorithms image processing |
| Abstract | Two new Euclidean distance transform algorithms are described. The algorithms are designed using a shortest path graph-search framework. The distance transform can be seen as the solution of a shortest path forest problem. Previous works have dealt with the Euclidean distance transform (EDT) and with the shortest path forest problem, but none of them have presented an EDT using the graph-search approach. The proposed algorithms are very simple and yet belong to the class of one of the most efficient sequential algorithms. The algorithms easily extend to higher dimensions. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2000 > Fast Euclidean distance... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Fast Euclidean distance... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/6qtX3pFwXQZeBBx/w9y2f |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/w9y2f |
| Target File | 269-275.pdf |
| User Group | administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46PN6AP 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/04.27.03.08 5 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Notes | The conference was held in Gramado, RS, Brazil, from October 17 to 20. |
| Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label language lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |